New approximations for sequential optimization with discrete material interpolations
نویسندگان
چکیده
1. Abstract The Discrete Material Optimization (DMO) [1] is a technique employed in structural optimization problems, dealing with the choice of discrete candidate materials over a certain structural domain. It is based on the use of material interpolations, functions of design variables, which can be seen as weighted sums of these candidates. Its goal is to select the weights’ values by means of optimization techniques, in a way that the material being represented by the interpolation can assume the constitutive characteristics of one and only one of the proposed candidates. At the literature, the DMO was successfully employed in optimization problems of laminated composites, where the desire was to find orientation stacking sequence and material distribution in laminae of plates and shells. Such problems involve in their formulation compliance [1], natural frequencies [2], buckling loads [2, 3], etc. The solutions of these problems were all obtained by the Method of Moving Asymptotes (MMA) [4], which is grounded in Sequential Approximate Optimization (SAO) concepts also known as Approximation Concepts in optimization [5]. However, in many cases, such results do not provide final designs showing full convergence to well (uniquely) selected materials. This work presents a new solution strategy to DMO problems based on the proposal of a new class of second generation approximations [6] based on using DMO weights to define proper intermediate variables, which is shown to bring improvements in the utilization of SAO techniques. The results obtained show that such approximations provide superior convergence to DMO compliance minimization (maximization of stiffness) problems in terms of uniquely selected materials and final optimized designs. 2.
منابع مشابه
Continuous Discrete Variable Optimization of Structures Using Approximation Methods
Optimum design of structures is achieved while the design variables are continuous and discrete. To reduce the computational work involved in the optimization process, all the functions that are expensive to evaluate, are approximated. To approximate these functions, a semi quadratic function is employed. Only the diagonal terms of the Hessian matrix are used and these elements are estimated fr...
متن کاملA novel technique for a class of singular boundary value problems
In this paper, Lagrange interpolation in Chebyshev-Gauss-Lobatto nodes is used to develop a procedure for finding discrete and continuous approximate solutions of a singular boundary value problem. At first, a continuous time optimization problem related to the original singular boundary value problem is proposed. Then, using the Chebyshev- Gauss-Lobatto nodes, we convert the continuous time op...
متن کاملA Characterization Theorem for the Discrete Best Monotonic Approximation Problem
A characterization theorem is derived that motivates a procedure for generating discrete best monotonie approximations to n sequential data values, when a strictly convex objective function is used in the calculation. The procedure is highly useful in the discrete nonlinear optimization calculation that produces the best piecewise monotonie approximations to the data.
متن کاملA practical multiscale approach for optimization of structural damping
A simple and practical multiscale approach suitable for topology optimization of structural damping in a component ready for additive manufacturing is presented. The approach consists of two steps: First, the homogenized loss factor of a two-phase material is maximized. This is done in order to obtain a range of isotropic microstructures that have a connected stiff material phase. Second, the s...
متن کاملA Discrete Hybrid Teaching-Learning-Based Optimization algorithm for optimization of space trusses
In this study, to enhance the optimization process, especially in the structural engineering field two well-known algorithms are merged together in order to achieve an improved hybrid algorithm. These two algorithms are Teaching-Learning Based Optimization (TLBO) and Harmony Search (HS) which have been used by most researchers in varied fields of science. The hybridized algorithm is called A Di...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013